0.11/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.18 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.18/0.40 % Computer : n003.cluster.edu 0.18/0.40 % Model : x86_64 x86_64 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.18/0.40 % Memory : 8042.1875MB 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64 0.18/0.40 % CPULimit : 1200 0.18/0.40 % WCLimit : 120 0.18/0.40 % DateTime : Tue Jul 13 10:41:09 EDT 2021 0.18/0.40 % CPUTime : 0.18/0.40 % Number of cores: 8 0.18/0.40 % Python version: Python 3.6.8 0.18/0.41 # Version: 2.6rc1-ho 0.25/0.42 # No SInE strategy applied 0.25/0.42 # Trying AutoSched0 for 59 seconds 0.38/0.59 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S061N 0.38/0.59 # and selection function SelectMaxLComplexAPPNTNp. 0.38/0.59 # 0.38/0.59 # Preprocessing time : 0.085 s 0.38/0.59 # Presaturation interreduction done 0.38/0.59 0.38/0.59 # Proof found! 0.38/0.59 # SZS status Theorem 0.38/0.59 # SZS output start CNFRefutation 0.38/0.59 thf(fact_8_at__lst__asgd__ge, axiom, ![X697:a, X698:a, X699:set_a, X700:set_Product_prod_a_a]:(member_a @ X697 @ (prefer161218362good_a @ X698 @ X699 @ X700)=>member449909584od_a_a @ (product_Pair_a_a @ X697 @ X698) @ X700), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_8_at__lst__asgd__ge)). 0.38/0.59 thf(conj_0, conjecture, member449909584od_a_a @ (product_Pair_a_a @ z @ y) @ pr, file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.38/0.59 thf(fact_0_assms, axiom, member_a @ z @ (prefer161218362good_a @ y @ b @ pr), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_assms)). 0.38/0.59 thf(c_0_3, plain, ![X3015:a, X3016:a, X3017:set_a, X3018:set_Product_prod_a_a]:(~member_a @ X3015 @ (prefer161218362good_a @ X3016 @ X3017 @ X3018)|member449909584od_a_a @ (product_Pair_a_a @ X3015 @ X3016) @ X3018), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_at__lst__asgd__ge])])). 0.38/0.59 thf(c_0_4, negated_conjecture, ~member449909584od_a_a @ (product_Pair_a_a @ z @ y) @ pr, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.38/0.59 thf(c_0_5, plain, ![X3:a, X4:a, X13:set_a, X22:set_Product_prod_a_a]:(member449909584od_a_a @ (product_Pair_a_a @ X3 @ X4) @ X22|~member_a @ X3 @ (prefer161218362good_a @ X4 @ X13 @ X22)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.38/0.59 thf(c_0_6, plain, member_a @ z @ (prefer161218362good_a @ y @ b @ pr), inference(split_conjunct,[status(thm)],[fact_0_assms])). 0.38/0.59 thf(c_0_7, negated_conjecture, ~member449909584od_a_a @ (product_Pair_a_a @ z @ y) @ pr, inference(split_conjunct,[status(thm)],[c_0_4])). 0.38/0.59 thf(c_0_8, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7]), ['proof']). 0.38/0.59 # SZS output end CNFRefutation 0.38/0.59 # Proof object total steps : 9 0.38/0.59 # Proof object clause steps : 4 0.38/0.59 # Proof object formula steps : 5 0.38/0.59 # Proof object conjectures : 3 0.38/0.59 # Proof object clause conjectures : 1 0.38/0.59 # Proof object formula conjectures : 2 0.38/0.59 # Proof object initial clauses used : 3 0.38/0.59 # Proof object initial formulas used : 3 0.38/0.59 # Proof object generating inferences : 1 0.38/0.59 # Proof object simplifying inferences : 1 0.38/0.59 # Training examples: 0 positive, 0 negative 0.38/0.59 # Parsed axioms : 527 0.38/0.59 # Removed by relevancy pruning/SinE : 0 0.38/0.59 # Initial clauses : 885 0.38/0.59 # Removed in clause preprocessing : 191 0.38/0.59 # Initial clauses in saturation : 694 0.38/0.59 # Processed clauses : 1251 0.38/0.59 # ...of these trivial : 42 0.38/0.59 # ...subsumed : 186 0.38/0.59 # ...remaining for further processing : 1023 0.38/0.59 # Other redundant clauses eliminated : 181 0.38/0.59 # Clauses deleted for lack of memory : 0 0.38/0.59 # Backward-subsumed : 0 0.38/0.59 # Backward-rewritten : 19 0.38/0.59 # Generated clauses : 1318 0.38/0.59 # ...of the previous two non-trivial : 980 0.38/0.59 # Contextual simplify-reflections : 0 0.38/0.59 # Paramodulations : 765 0.38/0.59 # Factorizations : 0 0.38/0.59 # NegExts : 25 0.38/0.59 # Equation resolutions : 199 0.38/0.59 # Propositional unsat checks : 0 0.38/0.59 # Propositional check models : 0 0.38/0.59 # Propositional check unsatisfiable : 0 0.38/0.59 # Propositional clauses : 0 0.38/0.59 # Propositional clauses after purity: 0 0.38/0.59 # Propositional unsat core size : 0 0.38/0.59 # Propositional preprocessing time : 0.000 0.38/0.59 # Propositional encoding time : 0.000 0.38/0.59 # Propositional solver time : 0.000 0.38/0.59 # Success case prop preproc time : 0.000 0.38/0.59 # Success case prop encoding time : 0.000 0.38/0.59 # Success case prop solver time : 0.000 0.38/0.59 # Current number of processed clauses : 422 0.38/0.59 # Positive orientable unit clauses : 128 0.38/0.59 # Positive unorientable unit clauses: 0 0.38/0.59 # Negative unit clauses : 4 0.38/0.59 # Non-unit-clauses : 290 0.38/0.59 # Current number of unprocessed clauses: 924 0.38/0.59 # ...number of literals in the above : 1977 0.38/0.59 # Current number of archived formulas : 0 0.38/0.59 # Current number of archived clauses : 550 0.38/0.59 # Clause-clause subsumption calls (NU) : 64063 0.38/0.59 # Rec. Clause-clause subsumption calls : 50134 0.38/0.59 # Non-unit clause-clause subsumptions : 165 0.38/0.59 # Unit Clause-clause subsumption calls : 8299 0.38/0.59 # Rewrite failures with RHS unbound : 0 0.38/0.59 # BW rewrite match attempts : 47 0.38/0.59 # BW rewrite match successes : 19 0.38/0.59 # Condensation attempts : 0 0.38/0.59 # Condensation successes : 0 0.38/0.59 # Termbank termtop insertions : 70618 0.38/0.59 0.38/0.59 # ------------------------------------------------- 0.38/0.59 # User time : 0.172 s 0.38/0.59 # System time : 0.012 s 0.38/0.59 # Total time : 0.184 s 0.38/0.59 # Maximum resident set size: 2900 pages 0.38/0.59 EOF